Dynamically Avoiding the Substantial Throughput Penalty of FRR
نویسندگان
چکیده
منابع مشابه
Reinforcement learning for penalty avoiding policy making
Reinforcement Learning is a kind of machine learning. It aims to adapt an agent to a given environment with a clue to a reward. In general, the purpose of reinforcement learning system is to acquire an optimum policy that can maximize expected reward per an action. However, it is not always important for any environment. Especially, if we apply reinforcement learning system to engineering, we e...
متن کاملFluid Pipelines: Elastic Circuitry without Throughput Penalty
In chip design, pipeline depth and cycle time are fixed early in the design process but their impact on physical design can only be assessed when the implementation is mostly done, making it impractical to change such parameters. Elastic Systems are insensitive to latency, and thus enable changes in the pipeline depth late in the design time with low effort. Nevertheless, current Elastic System...
متن کاملAvoiding Connict Misses Dynamically in Large Direct-mapped Caches
This paper describes a method for improving the performance of a large direct-mapped cache by reducing the number of connict misses. Our solution consists of two components: an inexpensive hardware device called a Cache Miss Lookaside (CML) buuer that detects connicts by recording and summarizing a history of cache misses, and a software policy within the operating system's virtual memory syste...
متن کاملImproving Throughput and Fairness in WLANs through Dynamically Optimizing Backoff
Given the limited channel capacity in wireless LANs, it is important to achieve high throughput and good fairness through medium access control (MAC) schemes. Although many schemes have been proposed to enhance throughput or fairness of the original IEEE 802.11 standard, they either fail to consider both throughput and fairness, or to do so with complicated algorithms. In this paper, we propose...
متن کاملOn PCGS and FRR-automata
This paper presents the second part of the technical report [7] in which the study of the relation between Parallel Communicating Grammar Systems (PCGS) and Freely Rewriting Restarting Automata (FRR) has been initiated. The rst part of [7] is presented in [6]. Here, the distribution and generation complexity for PCGS are introduced and studied. It is shown that analysis by reduction for PCGS wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8070-1464